Activity Recognition with Multi-tapeFuzzy Finite Automata
نویسندگان
چکیده
منابع مشابه
Activity Recognition with Multi-tape Fuzzy Finite Automata
Recognizing the activities performed by the user in an unobtrusive manner is one of the important requisites of pervasive computing. Users perform a number of activities during their day to day life. Tracking and deciding what a user is doing at a given time involves a number of challenges. The lack of a precise pattern in doing an activity at different times is one among them. The number, orde...
متن کاملFinite State Automata and Image Recognition
In this paper we introduce finite automata as a tool for specification and compression of gray-scale image. We describe, what are interests points in pictures and idea if they can hang together with resultant finite automata.
متن کاملCharacter Recognition with k-Head Finite Array Automata
We introduce the concept of k-head nite two-dimensional array automata and show how this model of two-dimensional array automata can be applied in the eld of syntactic character recognition. Moreover, we discuss some of the problems arising with implementing the theoretical concept to obtain an eecient tool for the syntactic analysis of handwritten (uppercase) characters.
متن کاملImage Storage, Indexing and Recognition with Finite State Automata
In this paper, we introduce the weighted finite state automata (WFA) as a tool for image specification and loss or loss-free compression. We describe how to compute WFA from input images and how the resultant automaton can be used to store images (or to create image database) and to obtain additional interesting information usable for image indexing or recognition. Next, we describe an automata...
متن کاملLanguage Recognition by Generalized Quantum Finite Automata with Unbounded Error
We prove that the class of languages recognized by generalized quantum finite automata (GQFA's) with unbounded error equals the class of stochastic languages. The capability of performing additional intermediate projective measurements does not increase the recognition power of GQFA's over Kondacs-Watrous quantum finite automata in this setting. Unlike their probabilistic counterparts, allowing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Education and Computer Science
سال: 2013
ISSN: 2075-0161,2075-017X
DOI: 10.5815/ijmecs.2013.05.07